Mesh Independence for Nonlinear Least Squares Problems with Norm Constraints
نویسندگان
چکیده
منابع مشابه
Least Squares Problems with Absolute Quadratic Constraints
This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a generalized theory following Bookstein’s conic-fitting and Fitzgibbon’s direct ellipse-specific fitting. Under simple preconditions, it can be shown that a minimum always exists and can be determined by a generalized eigenvalue problem. This problem is numerically reduced to an eigenvalue problem...
متن کاملVariable projection for nonlinear least squares problems
The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...
متن کاملLeast squares problems with inequality constraints as quadratic constraints
Linear least squares problems with box constraints are commonly solved to find model parameters within bounds based on physical considerations. Common algorithms include Bounded Variable Least Squares (BVLS) and the Matlab function lsqlin. Here, we formulate the box constraints as quadratic constraints, and solve the corresponding unconstrained regularized least squares problem. Box constraints...
متن کاملSolving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
We introduce a partial proximal point algorithm for solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints. For the inner subproblems, we show that the positive definiteness of the generalized Hessian of the objective function for the inner subproblems is equivalent to the constraint nondegeneracy of the corresponding primal problem, whi...
متن کاملSafe Subspace Screening for Nuclear Norm Regularized Least Squares Problems
Nuclear norm regularization has been shown very promising for pursing a low rank matrix solution in various machine learning problems. Many efforts have been devoted to develop efficient algorithms for solving the optimization problem in nuclear norm regularization. Solving it for large-scale matrix variables, however, is still a challenging task since the complexity grows fast with the size of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1993
ISSN: 1052-6234,1095-7189
DOI: 10.1137/0803005